An efficient lower bound algorithm for channel routing
نویسندگان
چکیده
منابع مشابه
An efficient lower bound algorithm for channel routing
Channel routing plays a central role in the physical design of VLSI chips. For two-layer dogleg-free channel routing, dm,, and v,, are the two traditional lower bounds. In this paper, we present two efficient algorithms for computing a tighter lower bound for the channel routing problem. Our algorithms succe:j~fully compute a lower bound of 26 for Deutsch's Difficult Example (DDE). The experime...
متن کاملAn Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing
Channel routing is a key problem in the physical design of VLSI chips. It is known that ma4dmz, urn,,) is a lower bound on the number of tmcka requared in the reserved two-layer Manhattan routine model. where d,,,,, is the channel density and vi, is the length oftKe longest path in the vertical constraint omvh. In this paver we vropose a polynomial time algorithm that ‘wmput’es a better and non...
متن کاملAn Efficient Algorithm for Reliability Lower Bound of Distributed Systems
The reliability of distributed systems and computer networks have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), under the node fault model is very useful, but is an NP−hard problem. Since it may need exponential time of the network size to compute the exact value of R(G), it is important to calculate its tight appr...
متن کاملA Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem
Study of algorithms and its design can be progressed in various dimensions. In this paper, we have a definite refinement of lower bound on the number of tracks required to route a channel. The attack is from a complementary viewpoint. Our algorithm succeeds to avoid all kind of approximation. The approach performs exact mapping of the problem into graphical presentation and analyzes the graph t...
متن کاملAn Optimal Lower Bound for Interval Routing in General Networks
Interval routing is a space-efficient (compact) routing method for point-topoint communication networks. The method is based on proper labeling of edges of the graph with intervals. An optimal labeling would result in routing of messages through the shortest paths. Optimal labelings exist for regular as well as some of the common topologies, but not for arbitrary graphs. It has been shown that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integration, the VLSI Journal
سال: 1996
ISSN: 0167-9260
DOI: 10.1016/0167-9260(95)00024-0